Finding Best Fit for Hand-Drawn Curves using Polynomial Regression
نویسندگان
چکیده
منابع مشابه
RankFrag: A Machine Learning-Based Technique for Finding Corners in Hand-Drawn Digital Curves
We describe RankFrag: a technique which uses machine learning to detect corner points in hand-drawn digital curves. RankFrag classifies the stroke points by iteratively extracting them from a list of corner candidates. The points extracted in the last iterations are said to have a higher rank and are more likely to be corners. The technique has been tested on three different datasets described ...
متن کاملPolynomial Spline Confidence Bands for Regression Curves
Asymptotically exact and conservative confidence bands are obtained for a nonparametric regression function, using piecewise constant and piecewise linear spline estimation, respectively. Compared to the pointwise confidence interval of Huang (2003), the confidence bands are inflated by a factor proportional to {log (n)}, with the same width order as the Nadaraya-Watson bands of Härdle (1989), ...
متن کاملFinding the Best-Fit Bounding-Boxes
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding-box is the smallest bounding-box among all the possible orientations for the same shape. In the context of document image analysis, the shapes can be characters (individual components) or paragraphs (component groups...
متن کاملColor Reduction in Hand-drawn Persian Carpet Cartoons before Discretization using image segmentation and finding edgy regions
In this paper, we present a method for color reduction of Persian carpet cartoons that increases both speed and accuracy of editing. Carpet cartoons are in two categories: machine-printed and hand-drawn. Hand-drawn cartoons are divided into two groups: before and after discretization. The purpose of this study is color reduction of hand-drawn cartoons before discretization. The proposed algorit...
متن کاملFinding best possible constant for a polynomial inequality
Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number k that satisfies a+b+c+k(ab+bc+ca)−(k+1)(ab+bc+ca) ≥ 0 for all nonnegative real numbers a, b, c. Analogues problems often appeared in studies of inequalities and were dealt with by various methods. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2017
ISSN: 0975-8887
DOI: 10.5120/ijca2017915390